منابع مشابه
On Supermagic Regular Graphs
A graph is called supermagic if it admits a labelling of the edges by pairwise different consecutive positive integers such that the sum of the labels of the edges incident with a vertex is independent of the particular vertex. Some constructions of supermagic labellings of regular graphs are described. Supermagic regular complete multipartite graphs and supermagic cubes are characterized.
متن کاملH-supermagic labelings of graphs
A simple graph G admits an H-covering if every edge in E(G) belongs to a subgraph of G isomorphic to H. The graph G is H−magic if there exists a bijection f : V (G) [ E(G) ! {1, 2, 3, · · · , |V (G) [ E(G)|} such that for every subgraph H0 P of G isomorphic to H. G is said to be H − supermagic if f(V (G)) = {1, 2, 3, · · · , |V (G)|}. In thi...
متن کاملA construction of supermagic graphs
A graph is called supermagic if it admits a labelling of the edges by pairwise different consecutive positive integers such that the sum of the labels of the edges incident with a vertex is independent of the particular vertex. In this paper we will introduce a new construction of supermagic graphs using the special structure of their subgraphs. The supermagic complements of some bipartite grap...
متن کاملNumbers of edges in supermagic graphs
A graph is called supermagic if it admits a labelling of the edges by pairwise different consecutive integers such that the sum of the labels of the edges incident with a vertex is independent of the particular vertex. In the paper we establish some bounds for the number of edges in supermagic graphs.
متن کاملOn a Construction of Supermagic Graphs
Given two graphs G and H. The composition of G with H is the graph with vertex set V (G) × V (H) in which (u1, v1) is adjacent to (u2, v2) if and only if u1u2 ∈ E(G) or u1 = u2 and v1v2 ∈ E(H). In this paper, we prove that the composition of regular supermagic graph with a null graph is supermagic. With the help of this result we show that the composition of a cycle with a null graph is always ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Indonesian Journal of Combinatorics
سال: 2018
ISSN: 2541-2205
DOI: 10.19184/ijc.2018.2.2.1